0.00/0.08	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.08	% Command    : run_E %s %d THM
0.07/0.27	% Computer : n032.cluster.edu
0.07/0.27	% Model    : x86_64 x86_64
0.07/0.27	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.07/0.27	% Memory   : 8042.1875MB
0.07/0.27	% OS       : Linux 3.10.0-693.el7.x86_64
0.07/0.27	% CPULimit   : 1440
0.07/0.27	% WCLimit    : 180
0.07/0.27	% DateTime   : Thu Jul  4 07:10:53 EDT 2024
0.07/0.27	% CPUTime    : 
0.13/0.37	Running higher-order theorem proving
0.13/0.37	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.VpZyGu5WV3/E---3.1_20622.p
0.13/0.38	# Version: 3.2.0-ho
0.13/0.38	# Preprocessing class: HSSSSMSSSSMCSSA.
0.13/0.38	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.13/0.38	# Starting ho_unfolding_3 with 900s (5) cores
0.13/0.38	# Starting ehoh_best_sine_rwall with 180s (1) cores
0.13/0.38	# Starting new_bool_3 with 180s (1) cores
0.13/0.38	# Starting new_bool_1 with 180s (1) cores
0.13/0.38	# ehoh_best_sine_rwall with pid 20716 completed with status 0
0.13/0.38	# Result found by ehoh_best_sine_rwall
0.13/0.38	# Preprocessing class: HSSSSMSSSSMCSSA.
0.13/0.38	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.13/0.38	# Starting ho_unfolding_3 with 900s (5) cores
0.13/0.38	# Starting ehoh_best_sine_rwall with 180s (1) cores
0.13/0.38	# SinE strategy is gf500_gu_R04_F100_L20000
0.13/0.38	# Search class: HHUSF-FFSF11-DSSFFMBC
0.13/0.38	# partial match(2): HHUSF-FFSF11-SSSFFMBN
0.13/0.38	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.13/0.38	# Starting ehoh_best_nonlift with 98s (1) cores
0.13/0.38	# ehoh_best_nonlift with pid 20720 completed with status 0
0.13/0.38	# Result found by ehoh_best_nonlift
0.13/0.38	# Preprocessing class: HSSSSMSSSSMCSSA.
0.13/0.38	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.13/0.38	# Starting ho_unfolding_3 with 900s (5) cores
0.13/0.38	# Starting ehoh_best_sine_rwall with 180s (1) cores
0.13/0.38	# SinE strategy is gf500_gu_R04_F100_L20000
0.13/0.38	# Search class: HHUSF-FFSF11-DSSFFMBC
0.13/0.38	# partial match(2): HHUSF-FFSF11-SSSFFMBN
0.13/0.38	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.13/0.38	# Starting ehoh_best_nonlift with 98s (1) cores
0.13/0.38	# Preprocessing time       : 0.001 s
0.13/0.38	# Presaturation interreduction done
0.13/0.38	
0.13/0.38	# Proof found!
0.13/0.38	# SZS status Theorem
0.13/0.38	# SZS output start CNFRefutation
0.13/0.38	thf(decl_22, type, eps: ($i > $o) > $i).
0.13/0.38	thf(decl_23, type, if: $o > $i > $i > $i).
0.13/0.38	thf(decl_24, type, epred1_0: $i > $o).
0.13/0.38	thf(decl_27, type, esk3_0: $i).
0.13/0.38	thf(decl_29, type, esk5_0: $i).
0.13/0.38	thf(decl_41, type, esk17_0: $i).
0.13/0.38	thf(ifd, axiom, ((if)=(^[X1:$o, X2:$i, X3:$i]:(eps @ (^[X4:$i]:((((X1)&((X4)=(X2)))|(~((X1))&((X4)=(X3))))))))), file('/export/starexec/sandbox2/tmp/tmp.VpZyGu5WV3/E---3.1_20622.p', ifd)).
0.13/0.38	thf(conj, conjecture, ![X5:$i > $o]:(((eps @ X5)=(if @ (?[X2:$i]:((X5 @ X2))) @ (eps @ X5) @ (eps @ (^[X2:$i]:(~($true))))))), file('/export/starexec/sandbox2/tmp/tmp.VpZyGu5WV3/E---3.1_20622.p', conj)).
0.13/0.38	thf(choiceax, axiom, ![X5:$i > $o]:((?[X2:$i]:((X5 @ X2))=>(X5 @ (eps @ X5)))), file('/export/starexec/sandbox2/tmp/tmp.VpZyGu5WV3/E---3.1_20622.p', choiceax)).
0.13/0.38	thf(c_0_3, plain, ((if)=(^[Z0/* 19 */:$o, Z1:$i, Z2:$i]:(eps @ (^[Z3/* 9 */:$i]:((((Z0)&((Z3)=(Z1)))|(~((Z0))&(Z3)))))))), inference(fof_simplification,[status(thm)],[ifd])).
0.13/0.38	thf(c_0_4, negated_conjecture, ~(![X5:$i > $o]:(((eps @ X5)=(eps @ (^[Z0/* 9 */:$i]:(((?[X2:$i]:(X5 @ X2)&((Z0)=(eps @ X5)))|(~(?[X2:$i]:(X5 @ X2))&((Z0)=(eps @ (^[Z1/* 7 */:$i]:(~($true))))))))))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]), c_0_3])).
0.13/0.38	thf(c_0_5, plain, ![X10:$i > $o, X11:$i]:((~(X10 @ X11)|(X10 @ (eps @ X10)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])])).
0.13/0.38	thf(c_0_6, negated_conjecture, ((eps @ epred1_0)!=(eps @ (^[Z0/* 9 */:$i]:(((?[X2:$i]:(epred1_0 @ X2)&((Z0)=(eps @ epred1_0)))|(~(?[X2:$i]:(epred1_0 @ X2))&((Z0)=(eps @ (^[Z1/* 7 */:$i]:(~($true))))))))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])).
0.13/0.38	thf(c_0_7, plain, ![X5:$i > $o, X2:$i]:(((X5 @ (eps @ X5))|~((X5 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_5])).
0.13/0.38	thf(c_0_8, negated_conjecture, ((eps @ epred1_0)!=(eps @ (^[Z0/* 9 */:$i]:(((?[X58:$i]:((epred1_0 @ X58))&((Z0)=(eps @ epred1_0)))|(~(?[X59:$i]:((epred1_0 @ X59)))&((Z0)=(eps @ (^[Z1/* 7 */:$i]:(~(($true)))))))))))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.13/0.38	thf(c_0_9, plain, ![X2:$i]:(((eps @ (^[Z0/* 3 */:$i]:(((Z0)=(X2)))))=(X2))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_7])).
0.13/0.38	thf(c_0_10, plain, ((^[Z0/* 9 */:$i]:(((?[X60:$i]:((epred1_0 @ X60))&((Z0)=(eps @ epred1_0)))|(~(?[X61:$i]:((epred1_0 @ X61)))&((Z0)=(eps @ (^[Z1/* 7 */:$i]:(~(($true))))))))))!=(^[Z0/* 3 */:$i]:(((Z0)=(eps @ epred1_0))))), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_8, c_0_9])])).
0.13/0.38	thf(c_0_11, negated_conjecture, ((^[Z0/* 9 */:$i]:(((?[X62:$i]:((epred1_0 @ X62))&((Z0)=(eps @ epred1_0)))|(~(?[X63:$i]:((epred1_0 @ X63)))&((Z0)=(eps @ (^[Z1/* 7 */:$i]:(~(($true))))))))))!=(epred1_0)), inference(ext_eqres,[status(thm)],[c_0_8])).
0.13/0.38	thf(c_0_12, plain, (((?[X64:$i]:((epred1_0 @ X64))&((esk17_0)=(eps @ epred1_0)))|(~(?[X65:$i]:((epred1_0 @ X65)))&((esk17_0)=(eps @ (^[Z0/* 7 */:$i]:(~(($true))))))))<~>((esk17_0)=(eps @ epred1_0))), inference(neg_ext,[status(thm)],[c_0_10])).
0.13/0.38	thf(c_0_13, negated_conjecture, (((?[X66:$i]:((epred1_0 @ X66))&((esk3_0)=(eps @ epred1_0)))|(~(?[X67:$i]:((epred1_0 @ X67)))&((esk3_0)=(eps @ (^[Z0/* 7 */:$i]:(~(($true))))))))<~>(epred1_0 @ esk3_0)), inference(neg_ext,[status(thm)],[c_0_11])).
0.13/0.38	thf(c_0_14, plain, ![X2:$i]:((((eps @ epred1_0)!=(esk17_0))|~((epred1_0 @ X2)))), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])])).
0.13/0.38	thf(c_0_15, negated_conjecture, (((eps @ epred1_0)=(esk3_0))|((eps @ (^[Z0/* 4 */:$i]:(~($true))))=(esk3_0))|(epred1_0 @ esk3_0)), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_13])])).
0.13/0.38	thf(c_0_16, plain, ![X2:$i]:(~((epred1_0 @ X2))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]), c_0_14])).
0.13/0.38	thf(c_0_17, negated_conjecture, (((eps @ (^[Z0/* 4 */:$i]:(~($true))))=(esk3_0))|((eps @ epred1_0)=(esk3_0))), inference(sr,[status(thm)],[c_0_15, c_0_16])).
0.13/0.38	thf(c_0_18, plain, (((eps @ epred1_0)=(esk3_0))|((^[Z0/* 4 */:$i]:(~($true)))!=(epred1_0))), inference(ext_eqfact,[status(thm)],[c_0_17])).
0.13/0.38	thf(c_0_19, plain, ((eps @ epred1_0)=(esk3_0)), inference(sr,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_18]), c_0_16])).
0.13/0.38	thf(c_0_20, negated_conjecture, (((eps @ (^[Z0/* 4 */:$i]:(~($true))))=(esk3_0))|(epred1_0 @ esk3_0)|(epred1_0 @ esk5_0)), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_13])])).
0.13/0.38	thf(c_0_21, plain, (((eps @ (^[Z0/* 4 */:$i]:(~($true))))!=(esk17_0))|((esk3_0)!=(esk17_0))), inference(cn,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12]), c_0_19]), c_0_16])])).
0.13/0.38	thf(c_0_22, negated_conjecture, ((eps @ (^[Z0/* 4 */:$i]:(~($true))))=(esk3_0)), inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_20, c_0_16]), c_0_16])).
0.13/0.38	thf(c_0_23, negated_conjecture, ((esk3_0)!=(esk17_0)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.13/0.38	thf(c_0_24, plain, ((eps @ (^[Z0/* 4 */:$i]:(~($true))))=(esk17_0)), inference(cn,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]), c_0_19]), c_0_23])])).
0.13/0.38	thf(c_0_25, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_24]), c_0_23]), ['proof']).
0.13/0.38	# SZS output end CNFRefutation
0.13/0.38	# Parsed axioms                        : 5
0.13/0.38	# Removed by relevancy pruning/SinE    : 2
0.13/0.38	# Initial clauses                      : 2
0.13/0.38	# Removed in clause preprocessing      : 0
0.13/0.38	# Initial clauses in saturation        : 2
0.13/0.38	# Processed clauses                    : 93
0.13/0.38	# ...of these trivial                  : 3
0.13/0.38	# ...subsumed                          : 24
0.13/0.38	# ...remaining for further processing  : 66
0.13/0.38	# Other redundant clauses eliminated   : 13
0.13/0.38	# Clauses deleted for lack of memory   : 0
0.13/0.38	# Backward-subsumed                    : 31
0.13/0.38	# Backward-rewritten                   : 5
0.13/0.38	# Generated clauses                    : 181
0.13/0.38	# ...of the previous two non-redundant : 143
0.13/0.38	# ...aggressively subsumed             : 0
0.13/0.38	# Contextual simplify-reflections      : 12
0.13/0.38	# Paramodulations                      : 53
0.13/0.38	# Factorizations                       : 0
0.13/0.38	# NegExts                              : 13
0.13/0.38	# Equation resolutions                 : 14
0.13/0.38	# Disequality decompositions           : 0
0.13/0.38	# Total rewrite steps                  : 9
0.13/0.38	# ...of those cached                   : 7
0.13/0.38	# Propositional unsat checks           : 0
0.13/0.38	#    Propositional check models        : 0
0.13/0.38	#    Propositional check unsatisfiable : 0
0.13/0.38	#    Propositional clauses             : 0
0.13/0.38	#    Propositional clauses after purity: 0
0.13/0.38	#    Propositional unsat core size     : 0
0.13/0.38	#    Propositional preprocessing time  : 0.000
0.13/0.38	#    Propositional encoding time       : 0.000
0.13/0.38	#    Propositional solver time         : 0.000
0.13/0.38	#    Success case prop preproc time    : 0.000
0.13/0.38	#    Success case prop encoding time   : 0.000
0.13/0.38	#    Success case prop solver time     : 0.000
0.13/0.38	# Current number of processed clauses  : 17
0.13/0.38	#    Positive orientable unit clauses  : 3
0.13/0.38	#    Positive unorientable unit clauses: 2
0.13/0.38	#    Negative unit clauses             : 5
0.13/0.38	#    Non-unit-clauses                  : 7
0.13/0.38	# Current number of unprocessed clauses: 39
0.13/0.38	# ...number of literals in the above   : 122
0.13/0.38	# Current number of archived formulas  : 0
0.13/0.38	# Current number of archived clauses   : 49
0.13/0.38	# Clause-clause subsumption calls (NU) : 247
0.13/0.38	# Rec. Clause-clause subsumption calls : 156
0.13/0.38	# Non-unit clause-clause subsumptions  : 40
0.13/0.38	# Unit Clause-clause subsumption calls : 33
0.13/0.38	# Rewrite failures with RHS unbound    : 0
0.13/0.38	# BW rewrite match attempts            : 27
0.13/0.38	# BW rewrite match successes           : 11
0.13/0.38	# Condensation attempts                : 0
0.13/0.38	# Condensation successes               : 0
0.13/0.38	# Termbank termtop insertions          : 12453
0.13/0.38	# Search garbage collected termcells   : 85
0.13/0.38	
0.13/0.38	# -------------------------------------------------
0.13/0.38	# User time                : 0.008 s
0.13/0.38	# System time              : 0.001 s
0.13/0.38	# Total time               : 0.009 s
0.13/0.38	# Maximum resident set size: 1760 pages
0.13/0.38	
0.13/0.38	# -------------------------------------------------
0.13/0.38	# User time                : 0.008 s
0.13/0.38	# System time              : 0.003 s
0.13/0.38	# Total time               : 0.010 s
0.13/0.38	# Maximum resident set size: 1704 pages
0.13/0.38	% E---3.1 exiting
0.13/0.39	% E exiting
0.13/0.39	EOF